package 动态规划.不同的二叉搜索树;

/**
 * @author: wh(1835734390 @ qq.com)
 * @date: 2023/2/10 17:00
 * @description:
 * @version:
 */
public class Solution {
    public static void main(String[] args) {
        System.out.println(numTrees(5));
    }


    public static int numTrees(int n) {
        int[] G = new int[n + 1];
        G[0] = 1;
        G[1] = 1;

        for (int i = 2; i <= n; ++i) {
            for (int j = 1; j <= i; ++j) {
                G[i] += G[j - 1] * G[i - j];
            }
        }
        return G[n];
    }
}
